AN INVESTIGATION OF PCM CODING AND DECODING.BENEDETTI G.1972; E.S.R.O. TECH. NOTE; FR.; DA. 1972; NO 112; PP. (42P.); BIBL. 3 REF.Article

FAMILIES OF SEQUENCES WITH OPTIMAL HAMMING CORRELATION PROPERTIES.LEMPEL A; GREENBERGER H.1974; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1974; VOL. 20; NO 1; PP. 90-94; BIBL. 4 REF.Article

EFFICACITE D'UNE METHODE SIMPLE DE SYNCHRONISATION DES CODES UNIFORMES ET NON UNIFORMESSHTAR'KOV YU M.1974; IN: VOPR. KIBERN. SZHATIE DANNYKH.; MOSKVA; AKAD. NAUK SSSR; DA. 1974; PP. 143-154; BIBL. 4 REF.Book Chapter

OPTIMISATION DES CODES DE HAMMING TRONQUESDAVYDOV AA; KAPLAN LN; SMERKIS YU B et al.1981; PROBL. PEREDA. INF.; ISSN 0555-2923; SUN; DA. 1981; VOL. 17; NO 4; PP. 63-72; BIBL. 11 REF.Article

ERWEITERUNG DER ZUVERLAESSIGKEITSDECODIERUNG UND UNTERSUCHUNG IHRER LEISTUNGSFAEHIGKEIT BEI EINFACHEN PRODUKTCODES. = EXTENSION DU DECODAGE DE FIABILITE ET ETUDE DE SES PERFORMANCES DANS LE CAS D'UN CODE PRODUIT SIMPLETRONDLE K; VANCEK E.1978; NACHR. ELEKTRON.; DTSCH.; DA. 1978; VOL. 32; NO 5; PP. 155-158; ABS. ANGL.; BIBL. 5 REF.Article

ON CLIQUES AND PARTITIONS IN HAMMING SPACESCOHEN GERARD; FRANKL PETER.1981; ; FRA; PARIS: ENST; DA. 1981; ENST-C/81007; 8 P.; 30 CM; ABS. FRE; BIBL. 9 REF.; DEPARTEMENT SYSTEMES ET COMMUNICATIONSReport

THE TRIPLY SHORTENED BINARY HAMMING CODE IS OPTIMAL.BEST MR; BROUWER AE.1977; DISCRETE MATH; NETHERL.; DA. 1977; VOL. 17; NO 3; PP. 235-245; BIBL. 2 REF.Article

FURTHER RESULTS ON DECODERS FOR Q-ARY OUTPUT CHANNELS.REDDY SM.1974; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1974; VOL. 20; NO 4; PP. 552-554; BIBL. 7 REF.Article

ERROR-CORRECTING CAPABILITIES OF MULTILEVEL BLOCK CODES: AN UPPER BOUNDBELL DA.1973; PROC. INSTN ELECTR. ENGRS; G.B.; DA. 1973; VOL. 120; NO 6; PP. 621-622; BIBL. 4 REF.Serial Issue

PSEUDO-RANDOMNESS PROPERTIES OF BINARY SHIFT REGISTER SEQUENCES.FREDRICSSON SA.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 1; PP. 115-120; BIBL. 8 REF.Article

PROBABILITE DE DECODAGE.1974; REV. CETHEDEC; FR.; DA. 1974; VOL. 11; NO 1; PP. 5-27; BIBL. DISSEM.Article

MEMORY ERROR CORRECTING CODESGREEN WB.1982; ZIMBABWE ENG.; ISSN 0251-1037; ZWE; DA. 1982; VOL. 20; NO 3; PP. 385-388; BIBL. 1 REF.Article

FEHLERKORREKTUR-BAUSTEIN ERHOEHT SYSTEMZUVERLAESSIGKEIT = COMPOSANT DE CORRECTION D'ERREUR AMELIORANT LA FIABILITE D'UN SYSTEMESTREIT D.1980; ELEKTRONIK (MUENCH.); ISSN 0013-5658; DEU; DA. 1980; VOL. 29; NO 26; PP. 57-60; BIBL. 11 REF.Article

NECESSARY AND SUFFICIENT NUMBER OF PARITY CHECKS IN CODES CORRECTING RANDOM ERRORS AND BURSTS WITH WEIGHT CONSTRAINTS UNDER A NEW METRICMANOHAR LAL KAUSHIK.1979; INFORM. SCI.; USA; DA. 1979; VOL. 19; NO 1; PP. 81-90; BIBL. 10 REF.Article

BASIC AND EXTENDED CYCLIC HAMMING CODES.OWENS A; HARKNETT MR.1975; ELECTRON. ENGNG; G.B.; DA. 1975; VOL. 47; NO 574; PP. 34-37Article

AN ANALOGUE OF THE ERDOES-KO-RADO THEOREM FOR THE HAMMING SCHEMES H(N,Q)AERYUNG MOON.1982; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1982; VOL. 32; NO 3; PP. 386-390; BIBL. 6 REF.Article

UNTERSUCHUNG DES KORREKTURBEREICHS VON PRODUKTCODES UND BESTIMMUNG IHRER RESTFEHLERWAHRSCHEINLICHKEIT. = ETUDE DU DOMAINE DE CORRECTION DES CODES PRODUIT ET DETERMINATION DE LEUR PROBABILITE D'ERREURS RESIDUELLETRONDLE K; VANCEK E.1976; ARCH. ELEKTRON. UEBERTRAG.-TECH.; DTSCH.; DA. 1976; VOL. 30; NO 7-8; PP. 265-271; ABS. ANGL.; BIBL. 17 REF.Article

UNTERSUCHUNGEN DER STOERFESTIGKEIT EINES GESTUFTEN CODIERUNGSVERFAHRENS. = RECHERCHES SUR LA STABILITE D'UN MODE DE CODAGE A ECHELONSHAUPTMANN S; HILLER H.1976; NACHR.-TECH., ELEKTRON.; DTSCH.; DA. 1976; VOL. 26; NO 4; PP. 128-129; BIBL. 3 REF.Article

RELIABILITY AND PERFORMANCE OF ERROR-CORRECTING MEMORY AND REGISTER ARRAYSELKIND SA; SIEWIOREK DP.1980; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1980; VOL. 29; NO 10; PP. 920-927; BIBL. 11 REF.Article

BASIC AND EXTENDED CYCLIC HAMMING CODES.OWENS; HARKNETT.1976; ELECTRON. ENGNG; G.B.; DA. 1976; VOL. 48; NO 575; PP. 45-47Article

GENERALIZED HAMMING CODES FOR BURST-ERROR CORRECTION.BENELLI G; BIANCIARDI C; CAPPELLINI V et al.1975; ALTA FREG.; ITAL.; DA. 1975; VOL. 44; NO 11; PP. 658-661; ABS. ITAL.; BIBL. 6 REF.Article

LOOKASIDE TECHNIQUES FOR MINIMUM CIRCUIT MEMORY TRANSLATORSCARTER WC; DUKE KA; JESSEP DC JR et al.1973; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1973; VOL. 22; NO 3; PP. 283-289; BIBL. 5 REF.Serial Issue

ON BOUNDS FOR CODES IN HAMMING SCHEMES AND JOHNSON SCHEMESDE VROEDT C.1980; DELFT PROG. REP.; ISSN 501115; NLD; DA. 1980; VOL. 5; NO 2; PP. 78-91; BIBL. 3 REF.Article

CODES PARFAITS ET UNIFORMEMENT EMPILES.COHEN G; DEZA M.1976; REV. CETHEDOC; FR.; DA. 1976; VOL. 13; NO 49; PP. 35-44; BIBL. 2 P.Article

On the nonexistence of unknown perfect 6- and 8-codes in Hamming schemes H(n,q) with q arbitraryYIMING HONG.Osaka Journal of Mathematics. 1984, Vol 21, Num 3, pp 687-700, issn 0030-6126Article